A New Three-Valued Paraconsistent Logic
نویسنده
چکیده
Paraconsistent logic and three-valued semantics: The term Paraconsistent was first used by the Peruvian philosopher Francisco Miró Quesada in the Third Latin America Conference on Mathematical Logic in 1976. A logic is called paraconsistent if there are formulas φ and ψ such that {φ,¬φ} 0 ψ. Besides other semantics, the three-valued semantics of (paraconsistent) logics have always received special attentions from logicians like J. Lukasiewicz, S. C. Kleene and others and paraconsistentists like S. Jaśkowski, N.C.A. da Costa, G. Priest, R. Brady, C. Mortensen, D’Ottaviano, W. A. Carnielli, João Marcos etc. Parainconsistency axioms have been introduced in [5] in a way similar to classical two-valued logic.
منابع مشابه
N'5 as an Extension of G'3
We present an extension of GLukG, a logic that was introduced in [6] as a three-valued logic under the name of G3. GLukG is a paraconsistent logic defined in terms of 15 axioms, which serves as the formalism to define the p-stable semantics of logic programming. We introduce a new axiomatic system, N-GLukG, a paraconsistent logic that possesses strong negation. We use the 5-valued logic N ′ 5, ...
متن کاملRemarks on the applications of paraconsistent logic to physics ∗
In this paper we make some general remarks on the use of non-classical logics, in particular paraconsistent logic, in the foundational analysis of physical theories. As a case-study, we present a reconstruction of P. -D. Février’s ’logic of complementarity’ as a strict three-valued logic and also a paraconsistent version of it. At the end, we sketch our own approach to complementarity, which is...
متن کاملMaximally Paraconsistent Three-Valued Logics
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper, we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We ...
متن کاملRevisiting C1
We show that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid. We show with the help of an answer set programming (ASP) tool called clasp, that C1 is robust with respect to certain three valued paraconsistent logics with some desirable properties. In particular C1 is robust with respect to three-valued logic P2, a logic for which some of the De Mo...
متن کاملOn the strongest three-valued paraconsistent logic contained in classical logic
LP is a three-valued paraconsistent propositional logic which is essentially the same as J3. It has most properties that have been proposed as desirable properties of a reasonable paraconsistent propositional logic. However, it follows easily from already published results that there are exactly 8192 different three-valued paraconsistent propositional logics that have the properties concerned. ...
متن کامل